Oriented colouring of some graph products
نویسندگان
چکیده
We obtain some improved upper and lower bounds on the oriented chromatic number for different classes of products of graphs.
منابع مشابه
Oriented Colouring of some graphs
We obtain some improved upper and lower bounds on the oriented chromatic number for different classes of products of graphs.
متن کاملThe Parameterized Complexity of Oriented Colouring
The oriented colouring problem is intuitive and related to undirected colouring, yet remains NP-hard even on digraph classes with bounded traditional directed width measures. Recently we have also proved that it remains NP-hard in otherwise severely restricted digraph classes. However, unlike most other problems on directed graphs, the oriented colouring problem is not directly transferable to ...
متن کاملOn the oriented chromatic number of dense graphs
The oriented chromatic number of a graph G is the maximum, taken over all orientations of G, of the minimum number of colours in a proper vertex colouring of G such that between every pair of colour classes all edges have the same orientation. We investigate the oriented chromatic number of graphs, such as the hypercube, whose average degree is at least logarithmic in the number of vertices. Fo...
متن کاملThe oriented chromatic number of some grids
We define some infinite subfamily of hexagonal grids with the oriented chromatic number 5. We present an algorithm for oriented colouring of some hexagonal planar oriented grids. The algorithm uses BFS spanning tree of a subgraph of the dual graph of the grid and a homomorphism to some tournament of order 6. In general the difference between the number of colours given by the algorithm and the ...
متن کاملGame Colouring Directed Graphs
In this paper, a colouring game and two versions of marking games (the weak and the strong) on digraphs are studied. We introduce the weak game chromatic number χwg(D) and the weak game colouring number wgcol(D) of digraphs D. It is proved that if D is an oriented planar graph, then χwg(D) 6 wgcol(D) 6 9, and if D is an oriented outerplanar graph, then χwg(D) 6 wgcol(D) 6 4. Then we study the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 31 شماره
صفحات -
تاریخ انتشار 2011